منابع مشابه
Uniform eventown problems
Let n ≥ k ≥ l ≥ 2 be integers, and let F be a family of k-element subsets of an n-element set. Suppose that l divides the size of the intersection of any two (not necessarily distinct) members inF . We prove that the size ofF is at most (⌊n/l⌋ k/l ) provided n is sufficiently large for fixed k and l.
متن کاملPolynomial Time Uniform Word Problems
We have two polynomial time results for the uniform word problem for a quasivariety Q: (a) The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. (b) Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S(Q*) and the weak embedding closure S(Q*) of Q...
متن کاملOn uniform k-partition problems
We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A fe...
متن کاملNon-uniform Turán-type problems
Given positive integers n, k, t, with 2 ≤ k ≤ n, and t < 2, let m(n, k, t) be the minimum size of a family F of (nonempty distinct) subsets of [n] such that every k-subset of [n] contains at least t members of F , and every (k − 1)-subset of [n] contains at most t− 1 members of F . For fixed k and t, we determine the order of magnitude of m(n, k, t). We also consider related Turán numbers T≥r(n...
متن کاملTurán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.06.001